CCS , Locations and Asynchronous Transition

نویسنده

  • Mogens Nielsen
چکیده

Our aim is to provide a simple non-interleaved operational semantics for CCS in terms of a model that is easy to understand|asynchronous transition systems. Our approach is guided by the requirement that the semantics should identify the concurrency present in the system in a natural way, in terms of events occurring at independent locations in the system. We extend the standard interleaving transition system for CCS by introducing labels on the transitions with information about the locations of events. We then show that the resulting transition system is an asynchronous transition system which has the additional property of being elementary, which means that it can also be represented by a 1-safe net. We establish a close correspondence between our semantics and other approaches in terms of foldings. We also introduce a notion of bisimulation on asynchronous transition systems which preserves independence. We conjecture that the induced equivalence on CCS processes coincides with the notion of location equivalence proposed by Boudol et al.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Testing Theories for Asynchronous Languages

We study testing preorders for an asynchronous version of CCS called TACCS, where message emission is non blocking. We rst give a labelled transition system semantics for this language, which includes both external and internal choice operators. By applying the standard deenitions of may and must testing to this semantics we obtain two behavioural preorders based on asynchronous observations, <...

متن کامل

Programming with Behaviors in an ML Framework - The Syntax and Semantics of LCS

LCS is an experimental high level asynchronous parallel programming language primarily aimed at exploring design, implementation and use of programming languages based upon the behavioral paradigms introduced by CSP and CCS. The language extends Standard ML with primitives for concurrency and communication based upon a higher order extension of the CCS formalism. Typechecking enforces consisten...

متن کامل

Comparing the Eeciency of Asynchronous Systems Motivation and Introduction

A timed process algebra is developed for evaluating the temporal worst-case eeciency of asynchronous concurrent systems. For the sake of simplicity, we use a classical CCS-like algebra where actions may occur arbitrarily within a continuous time interval, yielding arbitrary relative speeds of the components. Via the timed testing approach, asynchronous systems are then related w.r.t. their wors...

متن کامل

Asynchronous Circuit Veri cation Using Trace Theory and CCS

We investigate asynchronous circuit veri cation using Dill s trace theory as well as Milner s CCS as mechanized by the Concur rency Workbench Trace theory is a formalism speci cally designed for asynchronous circuit speci cation and veri cation CCS is a gen eral purpose calculus of communicating systems that is being recently applied for hardware speci cation and veri cation Although both forma...

متن کامل

Trace and Testing Equivalence on Asynchronous Processes

We study trace and may-testing equivalences in the asynchronous versions of CCS and-calculus. We start from the operational deenition of the may-testing preorder and provide for it nitary and fully abstract trace-based characterizations, along with a complete in-equational proof system. We also touch upon two variants of this theory, by rst considering a more demanding equivalence notion (must-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009